Distance-pattern decoding of binary BCH codes.
نویسندگان
چکیده
منابع مشابه
A Simple Step-by-Step Decoding of Binary BCH Codes
In this letter, we propose a simplified step-by-step decoding algorithm for t-error-correcting binary Bose-ChaudhuriHocquenghem (BCH) codes based on logical analysis. Compared to the conventional stepby-step decoding algorithm, the computation complexity of this decoder is much less, since it significantly reduces the matrix calculation and the operations of multiplication. key words: BCH code,...
متن کاملA Modified Step-By-Step Decoding for Binary BCH Codes
This study presents a modified and conceptually simple step-by-step decoding algorithm for binary cyclic BCH codes. Step-by-step decoding temporarily changes one information bit value at a time and then checks weather the weight of the error pattern decreases by computing the corresponding syndrome matrix determinant. Based on the channel information, this study propose a modified step-by-step ...
متن کاملConstruction and decoding of BCH Codes
BCfi wdes over arbitrary finite ~~~nirnut:!tiv~ rings with identity arc drip& in LCF~S of their locator vector, The derivation is hased on the factorization of .I-’ -I over the unit ring of an ~tppropr~lt~ extension of the finite rin g. We prcscnt an ~~~ci~nt,d~~iu~ procedure, based on the modified Berlekamp Massey ;li~~~rithrn. for that codes. The code construction and the decoding proccdurcs ...
متن کاملErrors-and-erasures Decoding of Bch Codes
We give a Grr obner basis algorithm for errors-and-erasures decoding of BCH codes that avoids computation of the modiied syndrome polynomial. The decoding problem is viewed as an instance of a more general interpolation problem. Our algorithm has the same computational complexity as the Berlekamp{Massey algorithm but is more eecient in hardware.
متن کاملOn the decoding of quasi-BCH codes
In this paper we investigate the structure of quasi-BCH codes. In the first part of this paper we show that quasi-BCH codes can be derived from Reed-Solomon codes over square matrices extending the known relation about classical BCH and Reed-Solomon codes. This allows us to adapt the Welch-Berlekamp algorithm to quasi-BCH codes. In the second part of this paper we show that quasi-BCH codes can ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of the Institute of Television Engineers of Japan
سال: 1987
ISSN: 0386-6831,1884-9652
DOI: 10.3169/itej1978.41.175